Efficient Belief Propagation with Census and Intensity Measure
نویسندگان
چکیده
Stereo matching is one of the most active research areas in computer vision. In this paper, a novel stereo matching is proposed that utilizes Census measure and pixels-based intensity measure into data term of Belief Propagation algorithm. Traditional data term of Belief Propagation lies on pixels-based intensity measure, and its effect is not very well. We combine intensity and Census algorithm into data term, run through Belief Propagation algorithm and acquire more accurate results. This proposed method may be more exacter than traditional BP algorithm. The experimental results demonstrate the superior performance of our proposed method.
منابع مشابه
An FPGA-Based Real-Time System for 3D Stereo Matching, Combining Absolute Differences and Census with Aggregation and Belief Propagation
The implementation of 3D stereo matching in real time is an important problem for many vision applications and algorithms. The current work, extending previous results by the same authors, presents in detail an architecture which combines the methods of Absolute Differences, Census, and Belief Propagation in an integrated architecture suitable for implementation with Field Programmable Gate Arr...
متن کاملDynamic Fracture Analysis Using an Uncoupled Arbitrary Lagrangian Eulerian Finite Element Formulation
This paper deals with the implementation of an efficient Arbitrary Lagrangian Eulerian (ALE) formulation for the three dimensional finite element modeling of mode I self-similar dynamic fracture process. Contrary to the remeshing technique, the presented algorithm can continuously advance the crack with the one mesh topology. The uncoupled approach is employed to treat the equations. So, each t...
متن کاملCMPS 290C Project Efficient Belief Propagation for Image Restoration
The Markov Random Field (MRF) theory provides a consistent way for modeling context dependent entities such as image pixels. Trying to solve the image restoration problem in the MRF framework is an optimization problem that is NP hard, and approximation techniques like the belief propagation methods are proposed. The problem of the belief propagation is its inefficiency. In this project, I impl...
متن کاملAn Efficient Implementation of Belief Function Propagation
The local computation technique (Shafer et a!. 1987, Shafer and Shenoy 1988, Shenoy and Shafer 1986) is used for propagating belief functions in so called a Markov Tree. In this paper, we describe an efficient implementation of belief function propagation on the basis of the local computation technique. The presented method avoids all the redundant computations in the propagation process, and ...
متن کاملNonparanormal Belief Propagation (NPNBP)
The empirical success of the belief propagation approximate inference algorithm has inspired numerous theoretical and algorithmic advances. Yet, for continuous non-Gaussian domains performing belief propagation remains a challenging task: recent innovations such as nonparametric or kernel belief propagation, while useful, come with a substantial computational cost and offer little theoretical g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012